Stochastic satellite tracking with constrained budget via structured-chromosome genetic algorithms
نویسندگان
چکیده
Abstract This paper focuses on the scheduling under uncertainty of satellite tracking from a heterogeneous network ground stations taking into account allocated resources. An optimisation-based approach is employed to efficiently select optimal schedule that minimises final estimation uncertainty. Specifically, formulated as variable-size problem, and Structured-Chromosome Genetic Algorithm developed tackle mixed-discrete global optimisation. The search algorithm employs genetic operators specifically revised handle hierarchical spaces. orbit determination routine run within each call fitness function quantify resulting candidate schedule. scheduler tested optimisation in low Earth orbit, highly perturbed dynamical regime. obtained results show variants Algorithms always outperform fixed-size counterparts for comparison. In particular, shown find significantly better schedules severely limited budgets.
منابع مشابه
Solving a Stochastic Cellular Manufacturing Model by Using Genetic Algorithms
This paper presents a mathematical model for designing cellular manufacturing systems (CMSs) solved by genetic algorithms. This model assumes a dynamic production, a stochastic demand, routing flexibility, and machine flexibility. CMS is an application of group technology (GT) for clustering parts and machines by means of their operational and / or apparent form similarity in different aspects ...
متن کاملThree Hybrid Metaheuristic Algorithms for Stochastic Flexible Flow Shop Scheduling Problem with Preventive Maintenance and Budget Constraint
Stochastic flexible flow shop scheduling problem (SFFSSP) is one the main focus of researchers due to the complexity arises from inherent uncertainties and also the difficulty of solving such NP-hard problems. Conventionally, in such problems each machine’s job process time may encounter uncertainty due to their relevant random behaviour. In order to examine such problems more realistically, fi...
متن کاملBudget - Constrained
We study optimal procurement mechanisms for a financially constrained buyer subject to ex post incentive compatibility and individual rationality. In our setup, a buyer who has a fixed budget wishes to purchase a homogeneous product up to a maximum demand amount. We characterize the optimal mechanism when the budget constraint always binds and when the maximum demand constraint always binds. Wh...
متن کاملChromosome Reduction in Genetic Algorithms
Genetic Algorithms have been very successful as adaptive search techniques on a wide variety of problems However the GA has di culty with some problems such as those with rugged tness landscapes or those which require non binary genome representations Recent research has focused on new theories models and techniques for improving the performance of GAs on di cult problems Many new ideas have be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization and Engineering
سال: 2021
ISSN: ['1389-4420', '1573-2924']
DOI: https://doi.org/10.1007/s11081-021-09693-1